Unranked Anti-Unification with Hedge and Context Variables
نویسندگان
چکیده
In this work we study anti-unification for unranked terms and hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges s̃ and q̃ is concerned with finding their generalization, a hedge g̃ such that both s̃ and q̃ are instances of g̃ under some substitutions. Context variables are used to abstract vertical differences in the input hedges, and hedge variables are used to abstract horizontal differences. A rule based system in Huet’s style will be presented, which computes a set of generalizations of input hedges and records all the differences. The computed generalizations are least general among a certain class of generalizations.
منابع مشابه
Unranked Second-Order Anti-Unification
In this work we study anti-unification for unranked terms and hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges s̃ and q̃ is concerned with finding their generalization, a hedge g̃ such that both s̃ and q̃ are substitution instances of g̃. Second-order power is gained by using context variables to generalize vertical dif...
متن کاملAnti-Unification with Unranked Terms and Hedges
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges s̃1 and s̃2 is concerned with finding their generalization, a hedge q̃ such that both s̃1 and s̃2 are instances of q̃ under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with differe...
متن کاملAnti-Unification for Unranked Terms and Hedges
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges s1 and s2 is concerned with finding their generalization, a hedge q such that both s1 and s2 are instances of q under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with differe...
متن کاملClosure of Hedge-automata Languages by Hedge Rewriting Closure of Hedge-automata Languages by Hedge Rewriting
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...
متن کاملClosure of Hedge-Automata Languages by Hedge Rewriting
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...
متن کامل